Computing discrete shape operators on general meshes
نویسندگان
چکیده
Discrete curvature and shape operators, which capture complete information about directional curvatures at a point, are essential in a variety of applications: simulation of deformable two-dimensional objects, variational modeling and geometric data processing. In many of these applications, objects are represented by meshes. Currently, a spectrum of approaches for formulating curvature operators for meshes exists, ranging from highly accurate but computationally expensive methods used in engineering applications to efficient but less accurate techniques popular in simulation for computer graphics. We propose a simple and efficient formulation for the shape operator for variational problems on general meshes, using degrees of freedom associated with normals. On the one hand, it is similar in its simplicity to some of the discrete curvature operators commonly used in graphics; on the other hand, it passes a number of important convergence tests and produces consistent results for different types of meshes and mesh refinement.
منابع مشابه
Shape-Preserving Meshes
Smooth surfaces are approximated by discrete triangle meshes for applications in computer graphics. Various discrete operators have been proposed for estimating differential quantities of triangle meshes, such as curvatures, for geometric processing tasks. Since a smooth surface can be approximated by many different triangle meshes, we propose to investigate which triangle mesh yields an estima...
متن کاملA Discrete Duality Finite Volume Approach to Hodge Decomposition and div-curl Problems on Almost Arbitrary Two-Dimensional Meshes
Abstract. We define discrete differential operators such as grad, div and curl, on general two-dimensional non-orthogonal meshes. These discrete operators verify discrete analogues of usual continuous theorems: discrete Green formulae, discrete Hodge decomposition of vector fields, vector curls have a vanishing divergence and gradients have a vanishing curl. We apply these ideas to discretize d...
متن کاملA Primal-to-Primal Discretization of Exterior Calculus on Polygonal Meshes
Discrete exterior calculus (DEC) offers a coordinate-free discretization of exterior calculus especially suited for computations on curved spaces. We present an extended version of DEC on surface meshes formed by general polygons that bypasses the construction of any dual mesh and the need for combinatorial subdivisions. At its core, our approach introduces a polygonal wedge product that is com...
متن کاملShape-Up: Shaping Discrete Geometry with Projections
We introduce a unified optimization framework for geometry processing based on shape constraints. These constraints preserve or prescribe the shape of subsets of the points of a geometric data set, such as polygons, one-ring cells, volume elements, or feature curves. Our method is based on two key concepts: a shape proximity function and shape projection operators. The proximity function encode...
متن کاملA note on the triangle-centered quadratic interpolation discretization of the shape operator
In this note we consider a simple shape operator discretization for general meshes, based on computing an interpolating quadratic function passing through vertices of a triangle and its edge-adjacent neighbors. This approximation is computationally simple and consistent for a broad class of meshes. However, its convergence properties in the context of mesh optimization problems are not as good ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 25 شماره
صفحات -
تاریخ انتشار 2006